One-Input-Face MPCVP Is Hard for L, But in LogDCFL

نویسندگان

  • Tanmoy Chakraborty
  • Samir Datta
چکیده

A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circuit value problem (MPCVP) is in NC, and Limaye et. al. improved the bound to LogCFL. Barrington et. al. showed that evaluating monotone upward stratified circuits, a restricted version of the oneinput-face MPCVP, is in LogDCFL. In this paper, we prove that the unrestricted one-input-face MPCVP is also in LogDCFL. We also show this problem to be L-hard under quantifier free projections.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Monotone Circuits on Cylinders, Planes and Tori

We re-examine the complexity of evaluating monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC, and for the special case of upward stratified circuits, it is known to be in LogDCFL. We characterize cylindricality, which is stronger than planarity but strictly generalizes upward planarity, and make the characterization partia...

متن کامل

Improved Upper Bounds in Nc for Monotone Planar Circuit Value and Some Restrictions and Generalizations

The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the special case of upward stratified circuits, it is known to be in LogDCFL. In this paper we re-examine the complexity of MPCVP, with special attention to circuits with cylindrical embeddings. We characterize cylindricality, which is stronger than planarity but strictly g...

متن کامل

Model checking finite paths and trees

This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...

متن کامل

ارزیابی کارایی انرژی و تحلیل اقتصادی تولید پیاز (Allium cepa L.) در استان خراسان رضوی

Current conventional agricultural systems using intensive energy have to be revitalized through new integrated approaches relying on renewable energy resources, which can allow farmers to stop dependence on fossil resources. The aim of this study was determining the amount of input–output energy used in onion (Allium cepa L.) production in Khorasan Razavi province. For this purpose, the data wa...

متن کامل

Determining Effective Features for Face Detection Using a Hybrid Feature Approach

Detecting faces in cluttered backgrounds and real world has remained as an unsolved problem yet. In this paper, by using composition of some kind of independent features and one of the most common appearance based approaches, and multilayered perceptron (MLP) neural networks, not only some questions have been answered, but also the designed system achieved better performance rather than the pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006